On Finite Sequences Satisfying Linear Recursions
نویسنده
چکیده
For any field k and any integers m,n with 0 6 2m 6 n + 1, let Wn be the k-vector space of sequences (x0, . . . , xn), and let Hm ⊆ Wn be the subset of sequences satisfying a degree-m linear recursion, i.e. for which there exist a0, . . . , am ∈ k such that
منابع مشابه
On Multiperiodic Infinite Recursions and Their Finite Core
We define multiperiodic infinite recursions and show that for such a recursion there is a finite linear recursion, the finite core, which gives almost the same type of recur-sion except for a different offset. Moreover, if we add the sequences produced by all multiperiodic infinite recursions with a given finite core, we almost obtain a multiple of the sequence associated with the finite core.
متن کاملFrom a Polynomial Riemann Hypothesis to Alternating Sign Matrices
This paper begins with a brief discussion of a class of polynomial Riemann hypotheses, which leads to the consideration of sequences of orthogonal polynomials and 3-term recursions. The discussion further leads to higher order polynomial recursions, including 4-term recursions where orthogonality is lost. Nevertheless, we show that classical results on the nature of zeros of real orthogonal pol...
متن کاملPseudorandomness of binary sequences derived from linear recursions
In this paper we study the pseudorandomness of finite binary sequences derived from linear recursions. We show, that the well-distribution measure is small. Furthermore we also show that the correlation measures are small for small correlation orders, but if the order of the correlation is greater than the order of the linear recursion, then the correlation can be large. 2000 Mathematics Subjec...
متن کاملMatrices Related to the Pascal Triangle
for 0 ≤ i, j ∈ N. The matrix P is hence the famous Pascal triangle yielding the binomial coefficients and can be recursively constructed by the rules p0,i = pi,0 = 1 for i ≥ 0 and pi,j = pi−1,j + pi,j−1 for 1 ≤ i, j. In this paper we are interested in (sequences of determinants of finite) matrices related to P . The present section deals with some minors (determinants of submatrices) of the abo...
متن کامل1 Matrices related to the Pascal triangle
for 0 ≤ i, j ∈ N. The matrix P is hence the famous Pascal triangle yielding the binomial coefficients and can be recursively constructed by the rules p0,i = pi,0 = 1 for i ≥ 0 and pi,j = pi−1,j + pi,j−1 for 1 ≤ i, j. In this paper we are interested in (sequences of determinants of finite) matrices related to P . The present section deals with determinants of some minors of the above Pascal tria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002